On independence-friendly fixpoint logics
نویسنده
چکیده
We introduce a fixpoint extension of Hintikka and Sandu’s IF (independence-friendly) logic. We obtain some results on its complexity and expressive power. We relate it to parity games of imperfect information, and show its application to defining independence-friendly modal mu-calculi. Philosophia Scientiæ, 8 (2), 2004, 125–144.
منابع مشابه
The Complexity of Independence-Friendly Fixpoint Logic
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedding PFP, we show that its combined complexity is ExpSpace-hard, and moreover the logic includes second order logic (on finite structures).
متن کاملApproaches to Independence Friendly Modal Logic
The aim of the present paper is to discuss two different approaches for formulating independence friendly (IF) modal logic. In one of them, the language of basic modal logic is enriched with the slash notation familiar from IF first-order logics, and the resulting logic is interpreted in terms of games and uniform strategies. A different approach is formulated in the present paper: an IF modal ...
متن کاملUvA - DARE ( Digital Academic Repository ) Compositional natural language semantics using Independence Friendly Logic or Dependence Logic
Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics...
متن کاملCompositional Natural Language Semantics using Independence Friendly Logic or Dependence Logic
Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics...
متن کاملFixpoint Extensions of Temporal Description Logics
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Description Logics to obtain decidability and tight complexity results for temporal fixpoint extensions of these Description Logics and more generally for the decidable monodic fragments of first order logic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004